Recursive automorphisms of recursive linear orderings
نویسندگان
چکیده
منابع مشابه
On the Complexity of Recursive Path Orderings
Well-founded orderings on terms are useful in a variety of contexts in computer science, not only in simply proving the termination of equationally defined algorithms, but also in automated deduction, for example in restrictions of paramodulation [2,6] and in rewriting systems (for an excellent survey on orderings and their use in rewriting see [4]). In these settings, decision procedures for v...
متن کاملRecursive Path Orderings Can Also Be Incremental
In this paper the Recursive Path Ordering is adapted for proving termination of rewriting incrementally. The new ordering, called Recursive Path Ordering with Modules, has as ingredients not only a precedence but also an underlying ordering =B. It can be used for incremental (innermost) termination proofs of hierarchical unions by defining =B as an extension of the termination proof obtained fo...
متن کاملRecursive Path Orderings Can Be Context-Sensitive
Context-sensitive rewriting (CSR) is a simple restriction of rewriting which can be used e.g. for modelling non-eager evaluation in programming languages. Many times termination is a crucial property for program veriication. Hence, developing tools for automatically proving termination of CSR is necessary. All known methods for proving termination of (CSR) systems are based on transforming the ...
متن کاملLinear Recursive Functions
With the recent trend of analysing the process of computation through the linear logic looking glass, it is well understood that the ability to copy and erase data is essential in order to obtain a Turingcomplete computation model. However, erasing and copying do not need to be explicitly included in Turing-complete computation models: in this paper we show that the class of partial recursive f...
متن کاملLinear Recursive Sequences
A sequence is an infinite list of numbers, like The numbers in the sequence are called its terms. The general form of a sequence is a 1 , a 2 , a 3 ,. .. where a n is the n-th term of the sequence. In the example (1) above, a 1 = 1, a 2 = 2, a 3 = 4, and so on. The notations {a n } or {a n } ∞ n=1 are abbreviations for a 1 , a Occasionally the indexing of the terms will start with something oth...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 1984
ISSN: 0168-0072
DOI: 10.1016/0168-0072(84)90041-1